Solvable Groups with Many Bfc-subgroups
نویسنده
چکیده
We characterize the solvable groups without infinite properly ascending chains of non-BFC subgroups and prove that a non-BFC group with a descending chain whose factors are finite or abelian is a Černikov group or has an infinite properly descending chain of non-BFC subgroups.
منابع مشابه
On non-normal non-abelian subgroups of finite groups
In this paper we prove that a finite group $G$ having at most three conjugacy classes of non-normal non-abelian proper subgroups is always solvable except for $Gcong{rm{A_5}}$, which extends Theorem 3.3 in [Some sufficient conditions on the number of non-abelian subgroups of a finite group to be solvable, Acta Math. Sinica (English Series) 27 (2011) 891--896.]. Moreover, we s...
متن کاملA Geometric Classification of Some Solvable Groups of Homeomorphisms
We investigate subgroups of the group PLo(I) of piecewise-linear, orientation-preserving homeomorphisms of the unit interval with finitely many breaks in slope, under the operation of composition, and also subgroups of generalized Thompson groups Fn. We find geometric criteria determining the derived length of any such group, and use this criteria to produce a geometric classification of the so...
متن کاملA Geometric Classification of Some Solvable Groups of Homeomorphisms
We investigate subgroups of the group PLo(I) of piecewise-linear, orientation-preserving homeomorphisms of the unit interval with finitely many breaks in slope, under the operation of composition, and also subgroups of generalized Thompson groups Fn. We find geometric criteria determining the derived length of any such group, and use this criteria to produce a geometric classification of the so...
متن کاملSolvability in Groups of Piecewise-linear Homeomorphisms of the Unit Interval by Collin Bleak
We investigate subgroups of the group PLo(I) of piecewise-linear, orientation preserving homeomorphisms of the unit interval with finitely many breaks in slope, and also subgroups of Thompson’s group F . We find geometric criteria determining the derived length of any such group, and use this criteria to classify the solvable and non-solvable subgroups of PLo(I) and of F . Let H be a subgroup o...
متن کاملComputing in Solvable Matrix Groups
We announce methods for e cient management of solvable matrix groups over nite elds. We show that solvability and nilpotence can be tested in polynomial-time. Such e ciency seems unlikely for membership-testing, which subsumes the discrete-log problem. However, assuming that the primes in jGj (other than the eld characteristic) are polynomiallybounded, membership-testing and many other computat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000